Complexity of the Two-Variable Fragment with Counting Quantifiers
نویسندگان
چکیده
منابع مشابه
Complexity of the Two-Variable Fragment with Counting Quantifiers
The satisfiability and finite satisfiability problems for the two-variable fragment of firstorder logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
متن کاملComplexity of the Guarded Two-Variable Fragment with Counting Quantifiers
We show that the finite satisfiability problem for the guarded twovariable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of the result obtained in Kazakov [6], that the satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.
متن کاملData-Complexity of the Two-Variable Fragment with Counting Quantifiers
The data-complexity of both satisfiability and finite satisfiability for the two-variable fragment with counting is NP-complete; the data-complexity of both query-answering and finite query-answering for the two-variable guarded fragment with counting is co-NP-complete.
متن کاملComplexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers
We show that the satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.
متن کاملTwo-Variable First Order Logic with Counting Quantifiers: Complexity Results
Etessami, Vardi and Wilke [5] showed that satisfiability of two-variable first order logic FO[<] on word models is Nexptime-complete. We extend this upper bound to the slightly stronger logic FO[<, succ,≡], which allows checking whether a word position is congruent to r modulo q, for some divisor q and remainder r. If we allow the more powerful modulo counting quantifiers of Straubing, Thérien ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2005
ISSN: 0925-8531,1572-9583
DOI: 10.1007/s10849-005-5791-1